Notes on the Complexity of Complex Heads in a Minimalist Grammar
نویسنده
چکیده
The type of a minimalist grammar (MG) introduced in Stabler 1997 provides a simple algebraic formalization of the perspectives as they arise from Chomsky 1995b within the linguistic framework of transformational grammar. As known (cf. Michaelis 2001a, 2001b, Harkema 2001), this MG–type defines the same class of derivable string languages as, e.g., linear context–free (string) rewriting systems (Vijay–Shanker et al. 1987, Weir 1988). In this paper we show that, in terms of weak equivalence, the subclass of MGs which allow (overt) head movement but no phrasal movement in the sense of Stabler 1997, constitutes a proper subclass of linear indexed grammars (LIGs), and thus tree adjoining grammars. We also examine the “inner hierarchic complexity” of this embedding in some more detail by looking at the subclasses canonically resulting from the distinction between left and right adjunction of the moved head to the attracting one. Furthermore, we show that adding the possibility of phrasal movement by allowing at most one “indistinguishable” licensee to trigger such movement already increases the weak generative capacity of at least two of the considered subclasses, while this is not true for the particular subclass of MGs which do not employ any movement at all. The latter define the same class of derivable string languages as context free grammars. On the other hand however, MGs which do not employ head movement but whose licensee set consists of at most two elements, are shown to derive, i.a., languages not derivable by any LIG. In this sense our results contribute to shedding some light on the complexity as it arises from the interplay of two different structural transformation types whose common existence is often argued to be linguistically motivated. ∗This work has been funded by DFG–grant STA 519/1–1. A previous version was published in Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6), pp. 57–65, Universitá di Venezia.
منابع مشابه
Observations on Strict Derivational Minimalism
Deviating from the definition originally presented in [12], Stabler [13] introduced— inspired by some recent proposals in terms of a minimalist approach to transformational syntax—a (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two types can be shown to determine the same class of derivable string languages.
متن کاملUniversal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملSpecifiers, Not Heads, Determine Phrase and Clause Type
The idea that the head of an expression determines the type of that expression is a deeply entrenched axiom of modern linguistics. It is the basis of X-Bar Theory and Dependency Grammar and a key notion underlying Head Driven Phrase Structure Grammar (HPSG) and Generalized Phrase Structure Grammar (GPSG). It has a long history dating back at least to Bloomfield’s notion of endocentric construct...
متن کاملMinimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages
Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages. This allows us to conclude that taking into account the possibility of ‘seman...
متن کاملMarr's levels and the minimalist program.
A simple change to a cognitive system at Marr's computational level may entail complex changes at the other levels of description of the system. The implementational level complexity of a change, rather than its computational level complexity, may be more closely related to the plausibility of a discrete evolutionary event causing that change. Thus the formal complexity of a change at the compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002